Offline Handwritten & Typewritten Character Recognition using Template Matching
نویسندگان
چکیده
In the modern times identity verification has become an important task for various reasons. Mostly identity provided by the authorities is the combination of characters & digits. Now there are several techniques available to recognize them efficiently, & good accuracy rates also have been achieved for characters & digits recognition (Typewritten).But in case of handwritten characters, accuracy rate becomes low. In this paper performance of template matching technique is analyzed for handwritten & typewritten character recognition using two parameters i.e. accuracy rate & time taken for execution. Here template matching technique has been applied to offline Typewritten character set & offline Handwritten characters set. Keywords-OCRS, segmentation, binarisation, classification, matching, templates
منابع مشابه
A Template Matching Distance for Recognition of On-Line Mathematical Symbols
An on-line handwritten character recognition technique based on a template matching distance is proposed. In this method, the pen-direction features are quantized using the 8-level Freeman chain coding scheme and the dominant points of the stroke are identified using the first difference of the chain code. The distance between two symbols results from the difference of the respective chain code...
متن کاملLexicon-free handwritten word spotting using character HMMs
For retrieving keywords from scanned handwritten documents, we present a word spotting system that is based on character Hidden Markov Models. In an efficient lexicon-free approach, arbitrary keywords can be spotted without pre-segmenting text lines into words. For a multi-writer scenario on the IAM off-line database as well as for two single writer scenarios on historical data sets, it is show...
متن کاملPerformance Improvement Strategies on Template Matching
This paper proposes an algorithm for offline recognition of handwritten characters, especially effective for large set characters such as Korean and Chinese characters. The algorithm is based on a template matching method which is easy to implement but suffers from low recognition performance. Two strategies has been developed to improve the performance of the template matching: one is multi-st...
متن کاملInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology
With the advancement in the technology the jobs for the human kind is becoming more and more tedious with millions and trillions of documents waiting to be processed. Certainly, such a daunting tasks are next to impossible to be completed manually. Over a period, the things are getting automatically done with the robots or intelligent computer systems. Optical character recognition is one of su...
متن کاملA Survey of Elastic Matching Techniques for Handwritten Character Recognition
This paper presents a survey of elastic matching (EM) techniques employed in handwritten character recognition. EM is often called deformable template, flexible matching, or nonlinear template matching, and defined as the optimization problem of two-dimensional warping (2DW) which specifies the pixel-to-pixel correspondence between two subjected character image patterns. The pattern distance ev...
متن کامل